four-colour theorem

См. также в других словарях:

• Four color theorem — Example of a four colored map A four colori …   Wikipedia

• four-colour map problem — In topology, a long standing conjecture asserting that no more than four colours are required to shade in any map such that each adjacent region is coloured differently. First posed in 1852 by Francis Guthrie, a British math student, it was… …   Universalium

• Vier-Farben-Theorem — Der Vier Farben Satz (früher auch als Vier Farben Vermutung oder Vier Farben Problem bekannt) ist ein mathematischer Satz und besagt, dass vier Farben immer ausreichen, um eine beliebige Landkarte in der euklidischen Ebene so einzufärben, dass… …   Deutsch Wikipedia

• List of sets of four countries that border one another — This is a list of sets of at least four countries that border one another. According to four colour theorem, in geometric 2d space, no more than four continuous two dimensional shapes can all share one dimensional boundaries with each other.… …   Wikipedia

• De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia

• combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

• Kempe chain — In mathematics, a Kempe chain is a device used mainly in the study of the four colour theorem. History Kempe chains were first used by Alfred Kempe in his attempted proof of the four colour theorem. Even though his proof turned out to be… …   Wikipedia

• Percy John Heawood — Percy Heawood Born September 8, 1861(1861 09 08) Newport, Shropshire, England Died January 24, 1955(1955 01 …   Wikipedia

• Vier-Farben-Satz — Beispiel einer Vier Färbung Der Vier Farben Satz (auch Vier Farben Theorem, früher auch als Vier Farben Vermutung oder Vier Farben Problem bekannt) ist ein mathematischer Satz und besagt, dass vier Farben immer ausreichen, um eine beliebige… …   Deutsch Wikipedia

• Proof by exhaustion — Proof by exhaustion, also known as proof by cases, perfect induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases, and each case is proved separately. A… …   Wikipedia

• Проблема четырёх красок — Проблема четырёх красок  математическая задача, предложенная Ф. Гутри ( …   Википедия